An Optimal Construction of Node-Disjoint Shortest Paths in Hypercubes
نویسنده
چکیده
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an ndimensional hypercube, provided the existence of such node-disjoint shortest paths which can be verified in O(mn) time, where mn. The worst-case time complexity and space complexity of the construction procedure are both O(mn), which is optimal and hence improves previous results. In the situation that all of the source node and destination nodes are mutually distinct, experiment results show that the probability that there exist node-disjoint shortest paths (from the source node to the destination nodes) is greater than 87%, 89%, 91%, and 94% for m=n=4, 5, 6, and 7, respectively.
منابع مشابه
Optimal Routing for Odd-Even Rotations on BRGC Hypercubes
It has been an open problem for a long time whether there exists an optimal routing algorithm for rotations on BRGC hypercubes such that all the paths are shortest and link-disjoint. In this paper, we consider the routing problem of odd-even rotations on BRGC hypercubes. It is a generalization of the rotation problem on BRGC hypercubes such that even nodes and odd nodes can have different rotat...
متن کاملFrom Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the sets. It is shown that disjoint ordering is useful for network routing. More precisely, we show that Hall’s ‘marriage’ condition for a collection of finite sets guarantees the existence of a disjoint ordering for the set...
متن کاملAn Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint paths in any OTIS network with a connected basis network is presented, which is independent of any construction of node disjoint paths in its basis network. This general construction is effective and efficient, which ca...
متن کاملTime Optimal Node-to-Set Disjoint Paths Routing in Hypercubes
Due to their simplicity, hypercubes are a popular topology for the interconnection network of massively parallel systems. One critical issue when dealing with such parallel systems is routing: data transmission is at the center of any operation or computation. Additionally, as the number of processors inside modern supercomputers is huge, and continuously growing, fault tolerance ought to be ad...
متن کاملMonotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hypercube network would imply the existence of efficient monotonicity testers. In particular, if any ` disjoint source-sink pairs on the directed hypercube can be connected with edge-disjoint paths, then monotonicity of...
متن کامل